#include <cstdio>
#include <algorithm>

const int coins[] = { 1, 5, 10, 25, 50 };
const int count = sizeof(coins) / sizeof(int);
const int amount_max = 30000;

int main()
{
	long long F[ amount_max + 1 ];
	std::fill( F, F + amount_max + 1, 1 );
	for( int i = 1; i < count; i++ )
	{
		for( int j = coins[i]; j <= amount_max; j += 1 )
		{
			F[j] += F[j - coins[i]];
		}
	}

	while(1)
	{
		int n = 0;
		if( scanf( "%d", &n ) != 1 )
		{
			break;
		}
		long long m = F[n];
		if( m == 1 )
		{
			printf( "There is only 1 way to produce %d cents change.\n", n );
		}
		else
		{
			printf( "There are %lld ways to produce %d cents change.\n", m, n );
		}
	}
	return 0;
}
